Theory of computation - PDFSEARCH.IO - Document Search Engine

Theory of computation
Results: 2087

#	Item
81	ALIQUOT SEQUENCES WITH SMALL STARTING VALUES WIEB BOSMA Abstract. We describe the results of the computation of aliquot sequences with small starting values. In particular all sequences with starting values less than a m Add to Reading List Source URL: www.math.ru.nl Language: English - Date: 2016-04-11 09:06:29 Mathematics Number theory Integer sequences Discrete mathematics Divisor function Aliquot sequence Sequence Perfect number Amicable numbers Parity Prime number 11
82	BIT 39(3), pp. 539–560, 1999 FAST AND PARALLEL INTERVAL ARITHMETIC SIEGFRIED M. RUMP Inst. of Computer Science III, Technical University Hamburg-Harburg, Eißendorfer Str. 38, 21071 Hamburg, Germany. Add to Reading List Source URL: www.ti3.tu-harburg.de Language: English - Date: 2005-11-23 09:26:23 Mathematics Computer arithmetic Mathematical logic Theory of computation Numerical analysis Arithmetic Interval arithmetic Interval Constructible universe Ordinal number NC Machine epsilon
83	LNCSParallel Repetition of Computationally Sound Protocols Revisited Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2012-05-30 08:49:12 Computational complexity theory Theory of computation Cryptography Complexity classes Quantum complexity theory IP Proof of knowledge NP PP XTR PSPACE Communications protocol
84	Online Bipartite Matching with Random Arrivals: An Approach Based on Strongly Factor-Revealing LPs ∗ Mohammad Mahdian Add to Reading List Source URL: www.qiqiyan.com.s3-website-us-east-1.amazonaws.com Language: English - Date: 2012-07-04 18:28:36 Mathematics Mathematical analysis Theory of computation Combinatorial optimization Matching Linear programming Approximation algorithm Permutation Measure theory operator
85	Introduction & Motivation Relations and Operations Boolean and 3-element cases Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-08-14 00:50:42 Computational complexity theory Complexity classes Theory of computation FO PSPACE SO P EXPTIME Boolean algebra Co-NP-complete Reduction Descriptive complexity theory
86	Simple Extractors for All Min-Entropies and a New Pseudorandom Generator∗ Ronen Shaltiel † Christopher Umans ‡ Add to Reading List Source URL: users.cms.caltech.edu Language: English - Date: 2004-12-08 14:14:59 Cryptography Theoretical computer science Computational complexity theory Theory of computation Pseudorandomness Random number generation Randomness Randomness extractor Pseudorandom generator Extractor Advice List decoding
87	Intl. Symposium on Experimental Robotics, JuneLinguistic Composition of Semantic Maps and Hybrid Controllers ? Neil Dantam, Carlos Nieto-Granda, Henrik Christensen, and Mike Stilman Center for Robotics and Intelli Add to Reading List Source URL: www.neil.dantam.name Language: English - Date: 2016-07-08 17:59:42 Formal languages Combinatorics Mathematics Combinatorics on words Discrete mathematics Theoretical computer science Models of computation Finite automata Automata theory Pushdown automaton Finite-state machine Alphabet
88	PASS Approximation: A Framework for Analyzing and Designing Heuristics Uriel Feige ∗† Nicole Immorlica ∗‡ Add to Reading List Source URL: users.eecs.northwestern.edu Language: English - Date: 2009-09-15 22:21:32 Computational complexity theory Mathematics Theory of computation NP-complete problems Operations research Approximation algorithms Combinatorial optimization Set cover problem Linear programming relaxation Greedy algorithm Facility location problem Reduction
89	The key to blame: Gradual typing meets cryptography Jeremy Siek Philip Wadler Indiana University, USA Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2016-07-07 08:33:11 Theoretical computer science Mathematics Mathematical logic Logic in computer science Models of computation Lambda calculus Computability theory Valuation Denotational semantics Combinatory logic Holomorphic functional calculus
90	Dependent Types in Practical Programming Hongwei Xi December 6th, 1998 Department of Mathematical Sciences Carnegie Mellon University Add to Reading List Source URL: www.cs.bu.edu Language: English - Date: 1999-11-28 18:07:44 Software engineering Programming language theory Computing Type theory Functional languages Logic in computer science Programming paradigms Models of computation Denotational semantics Type system Programming language Constraint programming

UPDATE